On XML Integrity Constraints in the Presen e of DTDs
نویسندگان
چکیده
منابع مشابه
Containment and Integrity Constraints for XPath Fragments
XPath is a W3C standard that plays a crucial role in several in uential query, transformation, and schema standards for XML. Motivated by the larger challenge of XML query optimization, we investigate the problem of containment of XPath expressions under integrity constraints that are in turn formulated with the help of XPath expressions. Our core formalism consists of a fragment of XPath that ...
متن کاملXPath Query Satisfiability and Containment under DTD Constraints
In this thesis, we consider the XML query language XPath, along with XML documents whose integrity constraints are presented in the form of document type definitions (DTDs). In particular, we study the problems of XPath satisfiability and XPath containment in the presence of DTDs. The motivation for studying XPath is that it is the main language for navigating in and extracting information from...
متن کاملCharacterization of the Interaction of XML Functional Dependencies with DTDs
With the rise of XML as a standard model of data exchange, XML functional dependencies (XFDs) have become important to areas such as key analysis, document normalization, and data integrity. XFDs are more complicated than relational functional dependencies because the set of XFDs satisfied by an XML document depends not only on the document values, but also the tree structure and corresponding ...
متن کاملA Uni ed Constraint Model for XML
Integrity constraints are an essential part of modern schema de nition languages. They are useful for semantic speci cation, update consistency control, query optimization, etc. In this paper, we propose UCM, a model of integrity constraints for XML that is both simple and expressive. Because it relies on a single notion of keys and foreign keys, the UCMmodel is easy to use and makes formal rea...
متن کاملOn the Complexity of Verifying Consistency of XML Specifications
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsistent, and thus it is often desirable to check consistency at compile-time. It is known [16] that for general keys and foreign keys, and DTDs, the consistency problem is undecidable; however, it becomes NP-complete when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001